Ambiguous Representations of Semilattices, Imperfect Information, and Predicate Transformers
نویسندگان
چکیده
منابع مشابه
Underapproximating Predicate Transformers
We study the underapproximation of the predicate transformers used to give semantics to the modalities in dynamic and temporal logic. Because predicate transformers operate on state sets, we define appropriate powerdomains for sound approximation. We study four such domains — two are based on “set inclusion” approximation, and two are based on “quantification” approximation — and we apply the d...
متن کاملPredicate Transformers for Convex Powerdomains
We investigate laws for predicate transformers for the combination of nondeterministic choice and (extended) probabilistic choice, where predicates are taken to be functions to the extended nonnegative reals, or to closed intervals of such reals. These predicate transformers correspond to state transformers, which are functions to convex powerdomains, the appropriate powerdomains for the combin...
متن کاملPoset representations of distributive semilattices
We prove that for every distributive 〈∨, 0〉-semilattice S, there are a meet-semilattice P with zero and a map μ : P × P → S such that μ(x, z) ≤ μ(x, y)∨μ(y, z) and x ≤ y implies that μ(x, y) = 0, for all x, y, z ∈ P , together with the following conditions: (P1) μ(v, u) = 0 implies that u = v, for all u ≤ v in P . (P2) For all u ≤ v in P and all a,b ∈ S, if μ(v, u) ≤ a ∨ b, then there are a pos...
متن کاملcompactifications and representations of transformation semigroups
this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...
15 صفحه اولHealthiness Conditions for Predicate Transformers
The behavior of a program can be modeled by describing how it transforms input states to output states, the state transformer semantics. Alternatively, for verification purposes one is interested in a ’predicate transformer semantics’ which, for every condition on the output, yields the weakest precondition on the input that guarantees the desired property for the output. In the presence of com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Order
سال: 2019
ISSN: 0167-8094,1572-9273
DOI: 10.1007/s11083-019-09508-0